-
1 Neyman's factorization theorem
-
2 Neyman's factorisation theorem
= Neyman's factorization theoremFrench\ \ théorème de la factorisation de NeymanGerman\ \ Neymanscher FaktorisierungssatzDutch\ \ Neyman's factorisatie-theoremaItalian\ \ teorema di fattorizzazione di NeymanSpanish\ \ teorema de la facturización de NeymanCatalan\ \ teorema de factorització de NeymanPortuguese\ \ teorema da factorização de Neyman; teorema da fatorização de Neyman (bra)Romanian\ \ -Danish\ \ -Norwegian\ \ -Swedish\ \ -Greek\ \ θεώρημα παραγοντοποίησης του NeymanFinnish\ \ Neymanin faktorointiteoreemaHungarian\ \ Neyman-féle faktorizálási tételTurkish\ \ Neyman'ın etkenlere ayırma teoremi; Neyman'ın faktörlere ayırma teoremi; Neyman'ın etkenlere ayırma savı; Neyman'ın faktörlere ayırma savıEstonian\ \ Neymani faktoriseerimisteoreemLithuanian\ \ Neyman faktorizacijos teorema; Neimano faktorizacijos teoremaSlovenian\ \ -Polish\ \ twierdzenie o faktoryzacji NeymanaRussian\ \ теорема факторизации НейманаUkrainian\ \ -Serbian\ \ -Icelandic\ \ -Euskara\ \ -Farsi\ \ -Persian-Farsi\ \ -Arabic\ \ نظرية التحليل لنيمانAfrikaans\ \ Neyman se faktorisasiestellingChinese\ \ 内 曼 因 子 分 解 定 理Korean\ \ 네이만의 분해정리 -
3 факторизационная теорема
Русско-английский научно-технический словарь Масловского > факторизационная теорема
-
4 теорема единственности
-
5 теорема единственности
Русско-английский новый политехнический словарь > теорема единственности
-
6 теорема единственности
Русско-английский словарь по информационным технологиям > теорема единственности
-
7 теорема о единственности разложения
Универсальный русско-английский словарь > теорема о единственности разложения
-
8 факторизационная теорема
Mathematics: factorization theoremУниверсальный русско-английский словарь > факторизационная теорема
-
9 теорема о единственности разложения числа
Русско-английский математический словарь > теорема о единственности разложения числа
-
10 теорема о единственности разложения числа
Русско-английский научный словарь > теорема о единственности разложения числа
-
11 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
-
12 В том смысле, что
The proof of the theorem is constructive in that it actually suggests an algorithm for computing the factorizationThis method has the advantage over capacitance methods in that it does not require differentiation to obtain...The computer is only automatic in the sense that it can deal with explicit instructionsРусско-английский словарь по прикладной математике и механике > В том смысле, что
См. также в других словарях:
Weierstrass factorization theorem — In mathematics, the Weierstrass factorization theorem in complex analysis, named after Karl Weierstrass, asserts that entire functions can be represented by a product involving their zeroes. In addition, every sequence tending to infinity has an… … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
Factorization lemma — In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect T . An application of this is regression analysis.TheoremLet T:Omega ightarrowOmega be a function of a set Omega… … Wikipedia
Fundamental theorem of arithmetic — In number theory, the fundamental theorem of arithmetic (or unique prime factorization theorem) states that every natural number greater than 1 can be written as a unique product of prime numbers. For instance, : 6936 = 2^3 imes 3 imes 17^2 , ,! … Wikipedia
Choi's theorem on completely positive maps — In mathematics, Choi s theorem on completely positive maps (after Man Duen Choi) is a result that classifies completely positive maps between finite dimensional (matrix) C* algebras. An infinite dimensional algebraic generalization of Choi s… … Wikipedia
Mittag-Leffler's theorem — In complex analysis, Mittag Leffler s theorem concerns the existence of meromorphic functions with prescribed poles. It is sister to the Weierstrass factorization theorem, which asserts existence of holomorphic functions with prescribed zeros. It … Wikipedia
Weierstrass theorem — Several theorems are named after Karl Weierstrass. These include: *The Weierstrass approximation theorem, also known as the Stone Weierstrauss theorem *The Bolzano Weierstrass theorem, which ensures compactness of closed and bounded sets in R n… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Lenstra elliptic curve factorization — The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub exponential running time algorithm for integer factorization which employs elliptic curves. Technically, the ECM is classified as a… … Wikipedia